Inverse p-median problems with variable edge lengths
نویسندگان
چکیده
منابع مشابه
Inverse p-median problems with variable edge lengths
The inverse p-median problem with variable edge lengths on graphs is to modify the edge lengths at minimum total cost with respect to given modification bounds such that a prespecified set of p vertices becomes a pmedian with respect to the new edge lengths. The problem is shown to be strongly NP-hard on general graphs and weakly NP-hard on series-parallel graphs. Therefore, the special case on...
متن کاملInverse median location problems with variable coordinates
Given n + 1 points in Rd with nonnegative weights, the inverse 1-median problem with variable coordinates consists in changing the coordinates of the given points at minimum cost such that a prespecified point in Rd becomes the 1-median. The cost is proportional to the increase or decrease of the corresponding point coordinate. In case that the distances between points are measured by the recti...
متن کاملThe inverse $p$-maxian problem on trees with variable edge lengths
We concern the problem of modifying the edge lengths of a tree in minimum total cost so that the prespecified p vertices become the p-maxian with respect to the new edge lengths. This problem is called the inverse p-maxian problem on trees. Gassner proposed efficient combinatorial alogrithm to solve the the inverse 1-maxian problem on trees in 2008. For the problem with p ≥ 2, we claim that the...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملThe Invere p-Maxian Problem on Trees with Variable Edge Lengths
We concern the problem of modifying the edge lengths of a tree in minimum total cost so that the prespecified p vertices become the p-maxian with respect to the new edge lengths. This problem is called the inverse p-maxian problem on trees. Gassner proposed efficient combinatorial alogrithm to solve the the inverse 1-maxian problem on trees in 2008. For the problem with p ≥ 2, we claim that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research
سال: 2011
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s00186-011-0346-5